Boolean model - PDFSEARCH.IO - Document Search Engine

Boolean model
Results: 352

#	Item
71	The Hong Kong Polytechnic University at the TREC 2004 Robust Track D.Y. Wang, R.W.P. Luk, K.F. Wong1 Department of Computing The Hong Kong Polytechnic University 1 Add to Reading List Source URL: trec.nist.gov Language: English WordNet Vector space model Query expansion Relevance feedback Word-sense disambiguation Document retrieval Extended Boolean model Precision and recall Natural language processing Information science Information retrieval Science
72	µZ– An Efficient Engine for Fixed points with Constraints? Kryˇstof Hoder, Nikolaj Bjørner, and Leonardo de Moura Manchester University and Microsoft Research Abstract. The µZ tool is a scalable, efficient engine Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2011-09-16 13:09:02 Mathematical logic Mathematical structures Model theory Algebraic logic Boolean algebra Finitary relation Structure Relational algebra Relation algebra Mathematics Algebra Abstract algebra
73	Robust, Web and Terabyte Retrieval with Hummingbird SearchServerTM at TREC 2004 Stephen Tomlinson Hummingbird Ottawa, Ontario, Canada Add to Reading List Source URL: trec.nist.gov Language: English Search engine indexing Precision and recall Document retrieval Tf*idf Enterprise search Extended Boolean model Relevance feedback Information science Information retrieval Relevance
74	A Max-Plus Model of Asynchronous Cellular Automata Add to Reading List Source URL: www.complex-systems.com Language: English - Date: 2015-03-31 16:26:33 Boolean network Asynchrony Computer architecture Science 8I SIGNAL Cell Asynchronous cellular automaton Cellular automata Cellular automaton Mathematics
75	Instantiations, Zippers and EPR Interpolation Nikolaj Bjørner, Arie Gurfinkel, Konstantin Korovin and Ori Lahav Microsoft Research, Software Engineering Institute, University of Manchester, Tel Aviv University Abstract Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2014-05-07 12:02:18 Model theory Automated theorem proving Boolean algebra Resolution Interpolation First-order logic Interpretation Unsatisfiable core Atomic formula Logic Mathematical logic Propositional calculus
76	1 Evaluation of Query Formulations in the Negotiated Query Reﬁnement Process of Legal e-Discovery: UMKC at TREC 2007 Legal Track Feng C. Zhao, Yugyung Lee, Deep Medhi Add to Reading List Source URL: trec.nist.gov Language: English - Date: 2008-02-11 09:14:36 Relevance Vector space model Search engine Extended Boolean model Information retrieval Relevance feedback Query expansion
77	THE EFFICIENT SYMBOLIC TOOLS PACKAGE Robert Meolic, Tatjana Kapus, Zmago Brezoˇcnik Faculty of Electrical Engineering and Computer Science University of Maribor Smetanova ul. 17, SI-2000 Maribor, Slovenia E-mail: fmeoli Add to Reading List Source URL: research.meolic.com Language: English - Date: 2013-12-04 04:28:45 Systems engineering Theoretical computer science Diagrams Formal methods Binary decision diagram Model checking Formal verification Boolean function Verification Boolean algebra Mathematics Mathematical logic
78	Software Engineering and Automated Deduction Willem Visser Nikolaj Bjørner Natarajan Shankar Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2014-05-07 12:02:12 Formal methods Automated theorem proving Logic in computer science NP-complete problems Model checking Satisfiability Modulo Theories Boolean satisfiability problem KeY First-order logic Theoretical computer science Logic Mathematical logic
79	Journal of Universal Computer Science, vol. 11, no), submitted: , accepted: 4/6/05, appeared: © J.UCS Model Checking, Automated Abstraction, and Compositional Verification of Rebeca Mod Add to Reading List Source URL: jucs.org Language: English - Date: 2006-11-02 05:53:39 Rebec FO Mathematical logic Mathematics Boolean algebra Theoretical computer science Boolean data type
80	Chapter 7 Exercises Exercise 1: Open the “7.2 Train Strike” model (on http://bayesianrisk.com/models.html). Enter the observations T= false in both parts of the model and run the model. Do the same for T=true, N=true Add to Reading List Source URL: www.bayesianrisk.com Language: English - Date: 2013-07-31 14:00:05 Boolean algebra Boolean data type Computing

UPDATE